A Modified Menezes-Vanstone Elliptic Curve Multi-Keys Cryptosystem
نویسنده
چکیده
This paper proposes a new modified variant of Menezes and Vanstone elliptic curve cryptosystem. This new variant uses the same original Menezes and Vanstone elliptic curve cryptosystem but in an elegant way. The new variant uses a not only one elliptic curve but a number of curves. Each curve is chosen with its corresponding keys to constitute a separate cryptosystem. The message is then divided into blocks such that each block is of a length less than the smallest prime number P of the used elliptic curves. The system uses a random sequence generator and modulus calculus to determine the elliptic curve which is used to encrypt/decrypt a certain message block. Added to the public keys of the system, the legal parties have a pre-communication session to compute and exchange some other private mutual keys (e.g., the keys of the random sequence generator). An implementation example will be explained and the security of the proposed variant will be discussed. KeywordsElliptic curve, Multi-key cryptosystems, Menezes_Vanstone Cryptosystem, Discrete logarithm problem.
منابع مشابه
ECC Based Threshold Cryptography for Secure Data Forwarding and Secure Key Exchange in MANET (I)
This paper proposes a new approach to provide reliable data transmission in MANET with strong adversaries. We combine Elliptic Curve Cryptography and Threshold Cryptosystem to securely deliver messages in n shares. As long as the destination receives at least k shares, it can recover the original message. We explore seven ECC mechanisms, El-Gamal, Massey-Omura, Diffie-Hellman, Menezes-Vanstone,...
متن کاملA Weakness of the Menezes - VanstoneCryptosystemKlaus
In this paper we show, that the elliptic curve cryptosystem by Menezes and Vanstone is not really a probabilistic cipher, in contrast to its design. Each ciphertext leaks some kind of information, which could be used for unauthorized decryption, if the cryptosystem is set up in a careless way. But in any case we have a loss of eeciency, since the additional eeort, which always comes with probab...
متن کاملThe State of Elliptic Curve Cryptography
Since the introduction of public-key cryptography by Diffie and Hellman in 1976, the potential for the use of the discrete logarithm problem in public-key cryptosystems has been recognized. Although the discrete logarithm problem as first employed by Diffie and Hellman was defined explicitly as the problem of finding logarithms with respect to a generator in the multiplicative group of the inte...
متن کاملA New Approach for Secured Transition using Prime Field Elliptic Curve Cryptography System
The demands of secured electronic transactions are increasing rapidly. Prime Field Elliptic curve cryptosystems (PFECC) are becoming most popular because of the reduced number of key bits required in comparison to other cryptosystems. PFECC is emerging as an attractive alternative to traditional public-key cryptosystems. PFECC offers equivalent security with smaller key sizes resulting in faste...
متن کاملData Security Analysis and Security Extension for Smart Cards Using Java Card
Smart cards improve the convenience and security of any transaction. They provide tamper-proof storage of user and account identity. Multifunction cards are used to manage network system access, store value and other data. The cards carry personal account, credit and buying-preference information and thus, security becomes a primary issue here. Public Key Cryptography plays an essential role in...
متن کامل